Scaling limits for simple random walks on random ordered graph trees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scaling limits of large random trees

The goal of these lectures is to survey some of the recent progress on the description of largescale structure of random trees. We will use the framework of Markov branching sequences of trees and develop several applications, to combinatorial trees, Galton-Watson trees, some dynamical models of randomly growing trees, cut trees, etc. This is a rough draft – to be completed – all comments are w...

متن کامل

Ordered Random Walks

We construct the conditional version of k independent and identically distributed random walks on R given that they stay in strict order at all times. This is a generalisation of so-called non-colliding or non-intersecting random walks, the discrete variant of Dyson’s Brownian motions, which have been considered yet only for nearest-neighbor walks on the lattice. Our only assumptions are moment...

متن کامل

Random walks on complex trees.

We study the properties of random walks on complex trees. We observe that the absence of loops is reflected in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and the mean topological displacement from the origin present a considerable slowing down in the tree case. Second, the mean first passage time (MFPT) display...

متن کامل

Random Walks on Rooted Trees

For arbitrary positive integers h and m, we consider the family of all rooted trees of height h having exactly m vertices at distance h from the root. We refer to such trees as (h,m)-trees. For a tree T from this family, we consider a simple random walk on T which starts at the root and terminates when it visits one of the m vertices at distance h from the root. Consider the problem of finding ...

متن کامل

Centers for Random Walks on Trees

We consider two distinct centers which arise in measuring how quickly a random walk on a tree mixes. Lovász and Winkler [8] point out that stopping rules which “look where they are going” (rather than simply walking a fixed number of steps) can achieve a desired distribution exactly and efficiently. Considering an optimal stopping rule that reflects some aspect of mixing, we can use the expecte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Probability

سال: 2010

ISSN: 0001-8678,1475-6064

DOI: 10.1239/aap/1275055241